Meta-Learning, Model Selection, and Example Selection in Machine Learning Domains with Concept Drift

نویسنده

  • Ralf Klinkenberg
چکیده

For many tasks where data is collected over an extended period of time, its underlying distribution is likely to change. A typical example is information filtering, i.e. the adaptive classification of documents with respect to a particular user interest. The interest of the user may change over time. Machine learning approaches handling concept drift have been shown to outperform more static approaches ignoring it in experiments with different types of simulated concept drifts on real-word text data and in experiments on real-world data for the task of classifying phases in business cycles exhibiting real concept drift. While previous concept drift handling approaches only use a single base learning algorithm and employ this same base learner at each step in time, this paper proposes a metalearning approach allowing the use of alternative learners and automatically selecting the most promising base learner at each step in time. This work in progress investigates, if such a contextdependent selection of the base learner leads to a better adaptation to the drifting concept, i.e. to lower classification error rates, than approaches based on single base learner only. Furthermore it investigates, how much the proposed metalearning approach allows to speed up the selection process and how much of the gained reduction in the error rate may be lost by that speed-up. The approaches with and without base learner selection and meta-learning are to be compared in experiments using real-world data from the above mentioned domains with simulated and real-world concept drifts, respectively.1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

متن کامل

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

متن کامل

Boosting classifiers for drifting concepts

This paper proposes a boosting-like method to train a classifier ensemble from data streams. It naturally adapts to concept drift and allows to quantify the drift in terms of its base learners. The algorithm is empirically shown to outperform learning algorithms that ignore concept drift. It performs no worse than advanced adaptive time window and example selection strategies that store all the...

متن کامل

Hypothesis Assessments as Guidance for Incremental and Meta-learning

In this paper, a new decision tree learning algorithm (INC-DT) is proposed: an incremental one based on hypotheses assessments. INC-DT uses only a xed amount of instance memory during the whole learning process. It bases its hypotheses exclusively on the last one computed , its assessment, and a xed number of seen examples. So, it is able to deal with initial knowledge and concept drift. Additi...

متن کامل

An Ensemble Classifier for Drifting Concepts

This paper proposes a boosting-like method to train a classifier ensemble from data streams. It naturally adapts to concept drift and allows to quantify the drift in terms of its base learners. The algorithm is empirically shown to outperform learning algorithms that ignore concept drift. It performs no worse than advanced adaptive time window and example selection strategies that store all the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005